Temporal information gathering process for node ranking in time-varying networks
نویسندگان
چکیده
منابع مشابه
Iterative Neighbour-Information Gathering for Ranking Nodes in Complex Networks
Designing node influence ranking algorithms can provide insights into network dynamics, functions and structures. Increasingly evidences reveal that node's spreading ability largely depends on its neighbours. We introduce an iterative neighbourinformation gathering (Ing) process with three parameters, including a transformation matrix, a priori information and an iteration time. The Ing process...
متن کاملInformation Gathering in Bayesian Networks
The optimal design of data acquisition is not obvious in Bayesian Network models. The dependency structure may vary dramatically, which makes learning and information evaluation complicated and sometimes non-intuitive. Our application, and the motivation for working on this topic, is prospect selection for petroleum exploration in the North Sea. Here, the data gathering is often carried out dur...
متن کاملNode-ranking schemes for the star networks
In this paper, three new node-ranking schemes for the star graph are presented and evaluated. These node-ranking schemes efficiently ‘‘embed’’ grids, pipelines, and reconfigurable multiple ring networks (cases of torus networks). These schemes improve similar known results on the star graph. They also allow efficient mapping of a wide class of algorithms into the star graph and hence facilitati...
متن کاملNetwork Coding for Long Information Lifetime in Time-Varying Networks
We consider a stochastic model for distributed network storage with highly volatile connectivity and node availability, common for edge/fog caching networks, and a random linear network coding (RLNC) scheme with varying levels of redundancy. The nodes store erasure-coded pieces of data and represent points of failure. Upon a node failure, the node is replaced by a new node, which regenerates th...
متن کاملRanking Information in Networks
Given an information network, we are interested in ranking sets of nodes that score highest on user-specified criteria. Examples include (1) discovering sets of authors with expertise in a wide range of disciplines; (2) finding sets of patents which, if removed, would have the greatest effect on the patent citation network; (3) identifying small sets of IP addresses which taken together account...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos: An Interdisciplinary Journal of Nonlinear Science
سال: 2019
ISSN: 1054-1500,1089-7682
DOI: 10.1063/1.5086059